<h2>题目编号 : 103</h2>
<div style="color:#666;font-size:80%;">26 August 2005</div><br />
<div class="problem_content">
<p>Let S(A) represent the sum of elements in set A of size <i>n</i>. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true:</p>
<ol style="list-style-type:lower-roman;">
<li>S(B) <img src='images/symbol_ne.gif' width='11' height='10' alt='&ne;' border='0' style='vertical-align:middle;' /> S(C); that is, sums of subsets cannot be equal.</li>
<li>If B contains more elements than C then S(B) <img src='images/symbol_gt.gif' width='10' height='10' alt='&gt;' border='0' style='vertical-align:middle;' /> S(C).</li>
</ol>
<p>If S(A) is minimised for a given <i>n</i>, we shall call it an optimum special sum set. The first five optimum special sum sets are given below.</p>
<p style="margin-left:50px;"><i>n</i> = 1: {1}<br />
<i>n</i> = 2: {1, 2}<br />
<i>n</i> = 3: {2, 3, 4}<br />
<i>n</i> = 4: {3, 5, 6, 7}<br />
<i>n</i> = 5: {6, 9, 11, 12, 13}</p>
<p>It <i>seems</i> that for a given optimum set, A = {<i>a</i><img src="" style="display:none;" alt="_(" /><sub>1</sub><img src="" style="display:none;" alt=")" />, <i>a</i><img src="" style="display:none;" alt="_(" /><sub>2</sub><img src="" style="display:none;" alt=")" />, ... , <i>a</i><img src="" style="display:none;" alt="_(" /><sub>n</sub><img src="" style="display:none;" alt=")" />}, the next optimum set is of the form B = {<i>b</i>, <i>a</i><img src="" style="display:none;" alt="_(" /><sub>1</sub><img src="" style="display:none;" alt=")" />+<i>b</i>, <i>a</i><img src="" style="display:none;" alt="_(" /><sub>2</sub><img src="" style="display:none;" alt=")" />+<i>b</i>, ... ,<i>a</i><img src="" style="display:none;" alt="_(" /><sub>n</sub><img src="" style="display:none;" alt=")" />+<i>b</i>}, where <i>b</i> is the &quot;middle&quot; element on the previous row.</p>
<p>By applying this &quot;rule&quot; we would expect the optimum set for <i>n</i> = 6 to be A = {11, 17, 20, 22, 23, 24}, with S(A) = 117. However, this is not the optimum set, as we have merely applied an algorithm to provide a near optimum set. The optimum set for <i>n</i> = 6 is A = {11, 18, 19, 20, 22, 25}, with S(A) = 115 and corresponding set string: 111819202225.</p>
<p>Given that A is an optimum special sum set for <i>n</i> = 7, find its set string.</p>
<p class="info">NOTE: This problem is related to problems <a href="index.php?section=problems&amp;id=105">105</a> and <a href="index.php?section=problems&amp;id=106">106</a>.</p>
</div><br />
